Removing propagation redundant constraints in redundant modeling
نویسندگان
چکیده
منابع مشابه
Removing redundant arguments automatically
The application of automatic transformation processes during the formal development and optimization of programs can introduce encumbrances in the generated code that programmers usually (or presumably) do not write. An example is the introduction of redundant arguments in the functions defined in the program. Redundancy of a parameter means that replacing it by any expression does not change t...
متن کاملPropagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraints may outweigh the gain of reduction in search space. In fact,many of the constraints in redundantmodelling are not only logically redundant but also propagation redundant and hence cannot further reduce search space....
متن کاملOn Redundant Topological Constraints
The Region Connection Calculus (RCC) [41] is a well-known calculus for representing part-whole and topological relations. It plays an important role in qualitative spatial reasoning, geographical information science, and ontology. The computational complexity of reasoning with RCC5 and RCC8 (two fragments of RCC) as well as other qualitative spatial/temporal calculi has been investigated in dep...
متن کاملSerializing Parallel Programs by Removing Redundant Computation
Programs often exhibit more parallelism than is actually available in the target architecture. This thesis introduces and evaluates three methods|loop unrolling, loop common expression elimination, and loop di erencing|for automatically transforming a parallel algorithm into a less parallel one that takes advantage of only the parallelism available at run time. The resulting program performs le...
متن کاملUsing Redundant Constraints for Refinement
This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid systems and more generally embedded systems with mixed continuous-discrete dynamics. In general, the reachable sets of such systems (except for some linear systems with special eigenstructures) are hard to compute exactly and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2007
ISSN: 1529-3785,1557-945X
DOI: 10.1145/1276920.1276925